Shortest Path Finding in Country using Hybrid approach of BBO and BCO
نویسندگان
چکیده
In this paper a hybrid approach of BBO and BCO technique is used to find the shortest path from source to the target point. The input data is a red band satellite image. In this image there are no prior paths and we don't have any prior information about the area. So path planning is a key factor to find out the optimized path which includes terrain mapping, obstacle detection and avoidance, and goal seeking in crosscountry using a hybrid approach of BBO and BCO techniques of Swarm Intelligence. In this hybrid approach Biogeography Based Optimization (BBO) is used for path extraction and obstacle detection from the red satellite image, morphological operation is used for smooth image and Bee Colony Optimization (BCO) algorithm is used for obstacle avoidance and shortest safe path from source to the target.
منابع مشابه
Cross-Country Path Finding using Hybrid approach of PSO and BBO
In this paper we have proposed the implementation of optimized path. We are residing on a geographical area and there is no road. So path planning is a key factor to find out the optimized path to travel to destination. This paper describes a novel approach of autonomous navigation for outdoor vehicles which includes terrain mapping, obstacle detection and avoidance, and goal seeking in cross-c...
متن کاملCross-Country Path Finding using Hybrid approach of BBO and ACO
Biogeography based optimization (BBO) and ant colony optimization (ACO) to develop global optimization path. In natural scenario, there are no prior paths and we don't have any prior information about any geographical area. The key factor to achieve a task in such area is Path planning; therefore this research direction is very useful in recent years. This hybrid approach describes autonomous n...
متن کاملFinding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملFinding the Optimal Path to Restoration Loads of Power Distribution Network by Hybrid GA-BCO Algorithms Under Fault and Fuzzy Objective Functions with Load Variations
In this paper proposes a fuzzy multi-objective hybrid Genetic and Bee colony optimization algorithm(GA-BCO) to find the optimal restoration of loads of power distribution network under fault.Restoration of distribution systems is a complex combinatorial optimization problem that should beefficiently restored in reasonable time. To improve the efficiency of restoration and facilitate theactivity...
متن کاملTwo optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کامل